NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
311	A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-02-09 05:54:36 Graph theory Mathematics NP-complete problems Graph coloring Hypergraph Dominating set Ear decomposition Graph Line graph Modular decomposition
312	Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments? Christian Komusiewicz, Manuel Sorge, and Kolja Stahl Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-06-25 05:19:55 Graph theory NP-complete problems Graph operations Clique Degeneracy Tree Degree Vertex Neighbourhood Clique problem BronKerbosch algorithm
313	Contemporary Mathematics Graph Partitioning for Scalable Distributed Graph Computations Aydın Bulu¸c and Kamesh Madduri Abstract. Inter-node communication time constitutes a significant fraction Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2013-03-15 01:10:50 Graph theory Mathematics NP-complete problems Graph partition Hypergraph Graph traversal Breadth-first search Vertex Graph Shortest path problem Ear decomposition HopcroftKarp algorithm
314	Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees Charalampos E. Tsourakakis1 Francesco Bonchi2 Aristides Gionis3 2 Add to Reading List Source URL: www.francescobonchi.com Language: English - Date: 2013-06-09 08:58:15 Graph theory NP-complete problems Dense subgraph Clique BronKerbosch algorithm Cograph Modular product of graphs
315	PDF Document Add to Reading List Source URL: www.zib.de Language: English - Date: 2010-10-28 06:01:03 Mathematical optimization Numerical analysis Operations research Combinatorial optimization Mathematics NP-complete problems Numerical software Column generation Linear programming SCIP Branch and bound DantzigWolfe decomposition
316	PDF Document Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-10-07 11:22:31 Graph theory NP-complete problems Graph connectivity Graph operations Graph coloring Degeneracy Tree Neighbourhood Clique K-edge-connected graph Vertex cover Degree
317	PDF Document Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-05-03 06:37:17 Graph theory NP-complete problems Clique Independent set Split graph Neighbourhood Bipartite graph Degree Vertex Graph Line graph Chordal graph
318	PDF Document Add to Reading List Source URL: www.francescobonchi.com Language: English - Date: 2013-10-23 04:38:55 Graph theory Directed graph Flow network Edsger W. Dijkstra Network theory NP-complete problems
319	AND-compression of NP-complete problems: Streamlined proof and minor observations Holger Dell Saarland University Cluster of Excellence, MMCI ∗ September 23, 2014 Add to Reading List Source URL: www.holgerdell.com Language: English
320	Protein Engineering vol.15 no.10 pp.779–782, 2002 Protein Design is NP-hard Niles A.Pierce1,2 and Erik Winfree3 1Applied Add to Reading List Source URL: www.piercelab.caltech.edu Language: English - Date: 2010-09-08 02:56:32 Complexity classes Mathematical optimization NP-complete problems Structural complexity theory NP-hard NP-complete Dead-end elimination NP P Theoretical computer science Computational complexity theory Applied mathematics

UPDATE